The P(n)/n-function for bi-infinite words
نویسندگان
چکیده
منابع مشابه
Infinite and Bi-infinite Words with Decidable Monadic Theories
We study word structures of the form (D,<,P ) where D is either N or Z, < is the natural linear ordering on D and P ⊆ D is a predicate on D. In particular we show: (a) The set of recursive ω-words with decidable monadic second order theories is Σ3complete. (b) Known characterisations of the ω-words with decidable monadic second order theories are transfered to the corresponding question for bi-...
متن کاملA characterization of periodicity of bi-infinite words
A finite word is called bordered if it has a proper prefix which is also a suffix of that word. Costa proves in (Theoret. Comput. Sci., 290(3):2053–2061, 2003) that a bi-infinite word w is of the form fgf, for some finite words f and g, if, and only if, there is a factorization w = suv, with u ∈ A such that every factor suv, with s 4 s and v ≤ v, is bordered. We present a shorter proof of that ...
متن کاملBounds on the Kolmogorov complexity function for infinite words
The Kolmogorov complexity function of an infinite word ξ maps a natural number to the complexity K(ξ n) of the n-length prefix of ξ. We investigate the maximally achievable complexity function if ξ is taken from a constructively describable set of infinite words. Here we are interested in linear upper bounds where the slope is the Hausdorff dimension of the set. As sets we consider Π1-definable...
متن کاملInfinite permutations vs. infinite words
I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. [4] permutations appear in a very similar framework as early as in 1977. I am going to tell about periodicity of permutations, their complexity accor...
متن کاملQuantifier Alternation for Infinite Words
We investigate the expressive power of the quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes Σi (sentences having at most i blocks of quantifiers starting with an ∃) and BΣi (Boolean combinations of Σi sentences). So far, this expressive power has been effectively characterized for the lower levels only. Recently, a breakthrough was made over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00432-1